Repository navigation
Implement the selected MOVE24472 with literal endpoint scaling, sharp signed width and paid restoration - #7563
Open
CubeJerry wants to merge 3 commits into
Conversation
…und the verified MOVE
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Result
A fixed 52-tape graph executes selected MOVE24472 with paid scale/header/width conversion, complete exact core, exact unscale and one public commit. For Gaussian-integral symmetric w-bit input/output endpoints, k=floor((f+2)/4) and width w+2k suffice and are sharp at that fixed scale. Full cost is O(fV'+E); all earlier storage remains charged.
Checks and limits
Exact source binding, normal/optimized replay, separate mathematical review, instruction relocation, independent integer/sparse-tape oracles and rejection controls pass. Reproduce bind_source.py, verify.py and endpoint_verify.py in the package. Actual caller packing/endpoint admission, faster recursion and all five global assumptions remain open. No new kappa.
Base e545235. Credit @CubeJerry, #7426, #7427, #7428, #7429, #7430, Nick Petalas #7468 and Gaussian norm predecessors; substantial OpenAI Codex assistance.
Full proof, exact sources, checks and proposed description